Random matrices in 2D, Laplacian growth and operator theory
نویسندگان
چکیده
منابع مشابه
Random Matrices in 2D, Laplacian Growth and Operator Theory
Since it was first applied to the study of nuclear interactions by Wigner and Dyson, almost 60 years ago, Random Matrix Theory (RMT) has developed into a field of its own whithin applied mathematics, and is now essential to many parts of theoretical physics, from condensed matter to high energy. The fundamental results obtained so far rely mostly on the theory of random matrices in one dimensio...
متن کاملRandom matrices and Laplacian growth
The theory of random matrices with eigenvalues distributed in the complex plane and more general “β-ensembles” (logarithmic gases in 2D) is reviewed. The distribution and correlations of the eigenvalues are investigated in the large N limit. It is shown that in this limit the model is mathematically equivalent to a class of diffusion-controlled growth models for viscous flows in the Hele-Shaw c...
متن کاملRandom Laplacian Matrices and Convex Relaxations
Abstract. The largest eigenvalue of a matrix is always larger or equal than its largest diagonal entry. We show that for a large class of random Laplacian matrices, this bound is essentially tight: the largest eigenvalue is, up to lower order terms, often the size of the largest diagonal entry. Besides being a simple tool to obtain precise estimates on the largest eigenvalue of a large class of...
متن کاملRandom Growth and Random Matrices
We give a survey of some of the recent results on certain two-dimensional random growth models and their relation to random matrix theory, in particular to the Tracy-Widom distribution for the largest eigenvalue. The problems are related to that of finding the length of the longest increasing subsequence in a random permutation. We also give a new approach to certain results for the Schur measu...
متن کاملAlgorithms, Graph Theory, and Linear Equations in Laplacian Matrices
The Laplacian matrices of graphs are fundamental. In addition to facilitating the application of linear algebra to graph theory, they arise in many practical problems. In this talk we survey recent progress on the design of provably fast algorithms for solving linear equations in the Laplacian matrices of graphs. These algorithms motivate and rely upon fascinating primitives in graph theory, in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics A: Mathematical and Theoretical
سال: 2008
ISSN: 1751-8113,1751-8121
DOI: 10.1088/1751-8113/41/26/263001